- Tutte polynomial
- полином m Татта
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Tutte matrix — In graph theory, the Tutte matrix A of a graph G = ( V , E ) is a matrix used to determine the existence of a perfect matching: that is, a set of edges which is incident with each vertex exactly once.If the set of vertices V has 2 n elements then … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
W. T. Tutte — William Thomas Tutte (May 14 1917 ndash; May 2 2002) was a British, later Canadian, codebreaker and mathematician. During World War II he broke a major German code system, which had a significant impact on the Allied invasion of Europe. He also… … Wikipedia
Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie … Wikipedia
Colored matroid — In mathematics, a colored matroid is a matroid whose elements are labeled from a set of colors, which can be any set that suits the purpose, for instance the set of the first n positive integers, or the sign set {+, −}. The interest in colored… … Wikipedia
Chvátal graph — Named after Václav Chvátal Vertices 12 Edges 24 … Wikipedia
Cycle space — This article is about a concept in graph theory. For space allocated to bicycles, see segregated cycle facilities. In graph theory, an area of mathematics, a cycle space is a vector space defined from an undirected graph; elements of the cycle… … Wikipedia